Perpaduan Diffie Hellman dan Blowfish sebagai Sistem Keamanan Dokumen

نویسندگان

چکیده

Keamanan data telah menjadi ancaman yang paling sensitive dan sering terjadi ditengah meningkatnya trafik cukup massif dalam jaringan internet. Untuk menjaga keamanan ada berbagai metode di usulkan diataranya dengan kriptografi. Kriptografi merupakan teknik matematika untuk menyandikan informasi (plaintext) ke bentuk tidak bisa baca atau dipahami (ciphertext) disebut proses enkripsi. kunci simetri penerapannya menggunakan sama enkripsi dekripsi sehingga waktu dibutuhkan pengoperasiannya relative rendah berbeda halnya asimetri. Algoritma Blowfish salah satu algoritma kriptografi block cipher 64bit memiliki ukuran bervariasi mulai dari 32bit sampai 448bit. blowfish sangat sesuai diimplementasikan pada aplikasi berbasis desktop (stand alone) namun demikian kekurangan saat implementasikan jaringan, hal ini disebabkan karena pendistribusian aman. Proses potensi terhadap serangan MITM (Man in The Middle Attack) jaringan. Potensi tersebut dapat dicegah melibatkan Diffie hellman pembangkitan simetri. Metode dua lebih entitas saling berkomunikasi bertukar angka melakukan perhitungan sederhana mendapatkan nantinya akan digunakan sebagai Kunci dibangkitkan blowfish.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sistem Informasi Akademik Online Sebagai Penunjang Sistem Perkuliahan

The development of Internet technology give a chance for application in all kind of humans activity include education specially for higher education in university in order to increase education quality. In this paper we will discuss about the importance of the elements which must be fulfilled when we build the online academic application with web technology which will help teaching process in u...

متن کامل

Knapsack Diffie-Hellman: A New Family of Diffie-Hellman

Diffie-Hellman problems have been widely involved in the design of various cryptographic protocols. Its general family is based on the discrete logarithm over a finite field. Since 2000, its another family which is based on elliptic curve discrete logarithm as well as bilinear pairing, e.g. Weil or Tate pairing, has been attracted significant studies. Thereafter, various cryptographic protocols...

متن کامل

Weak Composite Diffie-Hellman

In1985, Shmuley proposed a theorem about intractability of Composite Diffie-Hellman. The theorem of Shmuley may be paraphrased as saying that if there exist a probabilistic polynomial time oracle machine which solves the Diffie-Hellman modulo an RSA-number with odd-order bases then there exist a probabilistic algorithm which factors the modulo. In the other hand Shmuely proved the theorem only ...

متن کامل

A TPM Diffie-Hellman Oracle

This note describes a Diffie-Hellman oracle, constructed using standard Trusted Platform Module (TPM) signature APIs. The oracle allows one to compute the exponentiation of an arbitrary group element to a specified TPM-protected private key. By employing the oracle, the security provided by a group of order p is reduced by log k bits, provided k oracle queries are made and p± 1 is divisible by ...

متن کامل

Secure Bilinear Diffie-Hellman Bits

The Weil and Tate pairings are a popular new gadget in cryptography and have found many applications, including identity-based cryptography. In particular, the pairings have been used for key exchange protocols. This paper studies the bit security of keys obtained using protocols based on pairings (that is, we show that obtaining certain bits of the common key is as hard as computing the entire...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Jurnal infomedia : teknik informatika, multimedia, dan jaringan

سال: 2021

ISSN: ['2527-9858', '2549-1180']

DOI: https://doi.org/10.30811/jim.v6i2.2908